Applications Of Ant Colony Optimization ACO ( Travelling Salesman Problem
نویسنده
چکیده
-The ant colony optimization takes insipiration from the foraging behavior of some ant species.These ants deposits pheromone on the ground in order to make some suitable path that should be followed by other members of the colony.The goal of this paper is to introduce ant colony optimization and to survey its most notable applications.In this paper we focus on some research efforts directed at gaining a deeper understanding of the behavior of ant colony optimization algorithms in different fields. Keywords—Ant Colony optimization,metaheuristic algorithm,Parallel Ant Colony Optimization, Immunized Ant Colony Optimization.
منابع مشابه
A CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT: TWO HEURISTIC APPROACHES
A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...
متن کاملAn Effect and Analysis of Parameter on Ant Colony Optimization for Solving Travelling Salesman Problem
Ant Colony optimization has proved suitable to solve a wide range of combinatorial optimization (or NP-hard) problems as the Travelling Salesman Problem (TSP). The first step of ACO algorithm is to set the parameters that drive the algorithm. The parameter has an important impact on the performance of the ant colony algorithm. The basic parameters that are used in ACO algorithms are; the relati...
متن کاملA modified elite ACO based avoiding premature convergence for travelling salesmen problem
The Travelling Salesmen Problem (TSP) is one of the most important and famous combinational optimization problems that aim to find the shortest tour. In this problem, the salesman starts to move from an arbitrary place called depot and after visiting all nodes, finally comes back to depot. Solving this problem seems hard because program statement is simple and leads this problem belonging to NP...
متن کاملA Hybrid Optimization Algorithm Based on Genetic Algorithm and Ant Colony Optimization
In optimization problem, Genetic Algorithm (GA) and Ant Colony Optimization Algorithm (ACO) have been known as good alternative techniques. GA is designed by adopting the natural evolution process, while ACO is inspired by the foraging behaviour of ant species. This paper presents a hybrid GA-ACO for Travelling Salesman Problem (TSP), called Genetic Ant Colony Optimization (GACO). In this metho...
متن کاملEvaluation of Cost Optimization for Travelling Salesman Problem (TSP) by Comparing Various Ant Colony Optimization (ACO) Algorithms
This paper introduces one of the most profound Swarm Intelligence-based approaches, namely Ant Colony Optimization (ACO). The different operators in ACO and their effect on the quality of solution are briefly discussed. The ACO algorithms variants like Ant System (AS), Elitist Ant System (EAS), Rankbased Ant System (ASrank), Min-Max based Ant System (MMAS) are detailed. The paper puts forth a s...
متن کامل